An Extremal Problem in Graph Theory
نویسنده
چکیده
G(?z; I) will denote a graph of n vertices and 1 edges. Let fO(lz, K) be the smallest integer such that there is a G (n; f,, (n, k)) in which for every set of K vertices there is a vertex joined to each of these. Thus for example fO(3, 2) = 3 since in a triangle each pair of vertices is joined to a third. It can readily be checked that f,(4, 2) = 5 (the extremal graph consists of a complete 4-gon with one edge removed). In general we will prove: Let n > k, and
منابع مشابه
On the extremal total irregularity index of n-vertex trees with fixed maximum degree
In the extension of irregularity indices, Abdo et. al. [1] defined the total irregu-larity of a graph G = (V, E) as irrt(G) = 21 Pu,v∈V (G) du − dv, where du denotesthe vertex degree of a vertex u ∈ V (G). In this paper, we investigate the totalirregularity of trees with bounded maximal degree Δ and state integer linear pro-gramming problem which gives standard information about extremal trees a...
متن کاملSolving a nurse rostering problem considering nurses preferences by graph theory approach
Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...
متن کاملExtremal Graph Theory
3 Third Lecture 11 3.1 Applications of the Zarankiewicz Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 3.2 The Turán Problem for Trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 3.3 The Girth Problem and Moore’s Bound . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.4 Application of Moore’s Bound to Graph Spanners . . . . . . . . . . . ....
متن کاملGraph Polynomials and Graph Transformations in Algebraic Graph Theory
The thesis consists of two parts. In the first part we study two graph transformations,namely the Kelmans transformation and the generalized tree shift. In the second part of thisthesis we study an extremal graph theoretic problem and its relationship with algebraic graphtheory. The main results of this thesis are the following. • We show that the Kelmans transformation is a very ef...
متن کاملSelected Topics in the Extremal Graph Theory
Extremal problems in graph theory form a very wide research area. We study the following topics: the metric dimension of circulant graphs, the Wiener index of trees of given diameter, and the degree‐diameter problem for Cayley graphs. All three topics are connected to the study of distances in graphs. We give a short survey on the topics and present several new results.
متن کاملRational exponents in extremal graph theory
Given a family of graphs H, the extremal number ex(n,H) is the largest m for which there exists a graph with n vertices and m edges containing no graph from the family H as a subgraph. We show that for every rational number r between 1 and 2, there is a family of graphs Hr such that ex(n,Hr) = Θ(n r). This solves a longstanding problem in the area of extremal graph theory.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001